Rational functions certify combinatorial identities
نویسندگان
چکیده
منابع مشابه
Rational Functions Certify Combinatorial Identities
This paper presents a general method for proving and discovering combinatorial identities: to prove an identity one can present a certi cate that consists of a pair of functions of two integer variables. To prove the identity, take the two functions that are given, check that condition (1) below is satis ed (a simple mechanical task), and check the equally simple fact that the boundary conditio...
متن کاملA class of combinatorial identities
A general theorem for providing a class of combinatorial identities where the sum is over all the partitions of a positive integer is proven. Five examples as the applications of the theorem are given. © 2006 Elsevier B.V. All rights reserved.
متن کاملSome Combinatorial and Analytical Identities
We give new proofs and explain the origin of several combinatorial identities of Fu and Lascoux, Dilcher, Prodinger, Uchimura, and Chen and Liu. We use the theory of basic hypergeometric functions, and generalize these identities. We also exploit the theory of polynomial expansions in the Wilson and Askey-Wilson bases to derive new identities which are not in the hierarchy of basic hypergeometr...
متن کاملBinomial Identities - Combinatorial and Algorithmic
The problem of proving a particular binomial identity is taken as an opportunity to discuss various aspects of this eld and to discuss various proof techniques in an examplary way. In particular, the unifying r^ ole of the hypergeometric nature of binomial identities is underlined. This aspect is also basic for combinatorial models and techniques, developed during the last decade, and for the r...
متن کاملCombinatorial identities associated with CFTP
We explore a method of obtaining combinatorial identities by analysing partially-completed runs of the Coupling from the Past (CFTP) algorithm. In particular, using CFTP for simple symmetric random walk (ssrw) with holding boundaries, we derive an identity involving linear combinations of Cab(s) for different a and b, where Cab(s) is the probability that unconstrained ssrw run from 0 for time n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Mathematical Society
سال: 1990
ISSN: 0894-0347
DOI: 10.1090/s0894-0347-1990-1007910-7